SUBOPTIMAL DATA ASSOCIATION TECHNIQUE FOR MULTIPLE-TARGET TRACKING IN DENSE CLUTTER ENVIRONMENT
نویسندگان
چکیده
منابع مشابه
Suboptimal Target Tracking in Clutter Using a Generalized Probabilistic Data Association Algorithm
Simple tracking algorithms based upon nearest neighbor filtering do not correctly consider measurement origin uncertainty and, therefore, fail to perform well in situations of high target density and clutter. The optimal tracking algorithm for commonly used targetclutter models computes the posterior density of the target state conditioned on the past history of' observations. This posterior de...
متن کاملClutter Removal in Sonar Image Target Tracking Using PHD Filter
In this paper we have presented a new procedure for sonar image target tracking using PHD filter besides K-means algorithm in high density clutter environment. We have presented K-means as data clustering technique in this paper to estimate the location of targets. Sonar images target tracking is a very good sample of high clutter environment. As can be seen, PHD filter because of its special f...
متن کاملClutter Mitigation for Target Tracking
Traditionally, the literature on target tracking assumes that the targets of interest are embedded in homogenous Rayleigh distributed background noise. It is most often assumed that purely kinematic point measurements are extracted from the sensor images, so that the tracking problem can be phrased in terms of data association. The tracker has to decide which point measurements are likely to ha...
متن کاملA Comparison of Data Association Techniques for Target Tracking in Clutter
In tracking a single target in clutter, many algorithms have been developed ranging in complexity from nearest neighbor (NN) and probabilistic data association (PDA) to the optimal Bayesian filter. In multiple-target tracking, a number of the techniques have been exercised such as the JPDA and the multiple hypothesis (MHT) schemes. Sub-optimal algorithms, such as the PDA filter, have been used ...
متن کاملMarkov Chain Monte Carlo Data Association for Multiple-Target Tracking
This paper presents Markov chain Monte Carlo data association (MCMCDA) for solving data association problems arising in multiple-target tracking in a cluttered environment. When the number of targets is fixed, the single-scan version of MCMCDA approximates joint probabilistic data association (JPDA). Although the exact computation of association probabilities in JPDA is NP-hard, we prove that t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The International Conference on Electrical Engineering
سال: 2006
ISSN: 2636-4441
DOI: 10.21608/iceeng.2006.33689